Search results for "compact algorithms"
showing 2 items of 2 documents
Disturbed Exploitation compact Differential Evolution for Limited Memory Optimization Problems
2011
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a randomized perturbation of the virtual population corresponding to a periodical randomization of the search for the exploitative operators. The proposed Memetic Computing approach is based on a populationless (compact) evolutionary framework which, instead of processing a population of solutions, handles …
Algorithmic issues in computational intelligence optimization: from design to implementation, from implementation to design
2016
The vertiginous technological growth of the last decades has generated a variety of powerful and complex systems. By embedding within modern hardware devices sophisticated software, they allow the solution of complicated tasks. As side effect, the availability of these heterogeneous technologies results into new difficult optimization problems to be faced by researchers in the field. In order to overcome the most common algorithmic issues, occurring in such a variety of possible scenarios, this research has gone through cherry-picked case-studies. A first research study moved from implementation to design considerations. Implementation limitations, such as memory constraints and real-time r…